A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

Authors

  • Hani Pourvaziri Msc, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
  • parham azimi Assistant Professor, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
  • Ramtin Rooeinfar Msc, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Abstract:

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has different transporting vehicles and the cost of travel through each city is dependent on the transporting vehicles type. The aim is to determine an optimal sequence of visited cities with minimum traveling times by available transporting vehicles within a limited budget. First, the mathematical model of TSPMT is presented. Next, since the problem is NP-hard, a new hybrid parallel simulated annealing algorithm with a new coding scheme is proposed. To analyze the performance of the proposed algorithm, 50 numerical examples with different budget types are examined and solved using the algorithm. The computational results of these comparisons show that the algorithm is an excellent approach in speed and solution quality.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

a new hybrid parallel simulated annealing algorithm for travelling salesman problem with multiple transporters

in today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. in this paper, we present a new model for the traveling salesman problem with multiple transporters (tspmt). in the proposed model, which is more applicable than the traditional versions, each city has diffe...

full text

A New Simulated Annealing Approach for Travelling Salesman Problem

The aim of this study is to improve searching capability of simulated annealing (SA) heuristic through integration of two new neighborhood mechanisms. Due to its ease of formulation, difficulty to solve and various real life applications several Travelling Salesman Problems (TSP) were selected from the literature for the testing of the proposed methods. The proposed methods were also compared t...

full text

A Hybrid Particle Swarm Optimization – Simulated Annealing Algorithm for the Probabilistic Travelling Salesman Problem

The Probabilistic Traveling Salesman Problem (PTSP) is a variation of the well known Traveling Salesman Problem (TSP). This problem arises when the information about customers demand is not available at the moment of the tour generation and/or the tour re-calculating cost is too elevated. In this article, a Hybrid Algorithm combining Particle Swarm Optimization (PSO) and Simulated Annealing (SA...

full text

A new Simulated Annealing algorithm for the robust coloring problem

The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...

full text

Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem

Simulated annealing (SA) algorithm is a popular intelligent optimisation algorithm, but its efficiency is unsatisfactory. To improve its efficiency, this paper presents a swarm SA (SSA) algorithm by exploiting the learned knowledge from searching history. In SSA, a swarm of individuals run SA algorithm collaboratively. Inspired by ant colony optimisation (ACO) algorithm, SSA stores knowledge in...

full text

Markov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm

The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 7  issue 15

pages  1- 13

publication date 2014-09-10

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023